Probabilistic Temporal Interval Networks: Extended Version

نویسندگان

  • Vladimir Ryabov
  • André Trudel
چکیده

A Probabilistic Temporal Interval Network is a constraint satisfaction problem where the nodes are temporal intervals and the edges are uncertain interval relations. We attach a probability to each of Allen’s basic interval relations. An uncertain relation between two temporal intervals is represented as a disjunction of Allen’s probabilistic basic relations. Using the operations of inversion, composition, and addition, defined for this probabilistic representation, we propose a path consistency algorithm and an approach to finding consistent scenarios using a backtracking algorithm. We also discuss heuristic methods for optimizing the performance of the backtracking algorithm. Finally, we show how to estimate the probability of a consistent scenario.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Temporal Network for Numeric and Symbolic Time Information

We propose a probabilistic extension of Allen’s Interval Algebra for managing uncertain temporal relations. Although previous work on various uncertain forms of quantitative and qualitative temporal networks have been proposed in the literature, little has been addressed to the most obvious type of uncertainty, namely the probabilistic one. More precisely, our model adapts the probabilistic Con...

متن کامل

Finding the most probable solution to a probabilistic temporal Interval Algebra network

Over the years, many implementations have been proposed for solving IA networks. These implementations are concerned with finding a solution efficiently. The primary goal of our implementation is simplicity and ease of use. We present an IA network implementation based on finite domain non-binary CSPs, and constraint logic programming. The implementation has a GUI which permits the drawing of a...

متن کامل

Resilient Supplier Selection in a Supply Chain by a New Interval-Valued Fuzzy Group Decision Model Based on Possibilistic Statistical Concepts

Supplier selection is one the main concern in the context of supply chain networks by considering their global and competitive features. Resilient supplier selection as generally new idea has not been addressed properly in the literature under uncertain conditions. Therefore, in this paper, a new multi-criteria group decision-making (MCGDM) model is introduced with interval-valued fuzzy sets (I...

متن کامل

Performance Evaluation of Probabilistic Relay in Ad Hoc On-demand Distance Vector and Ad Hoc On-demand Multipath Distance Vector under Highly Dynamic Environments

Vehicular Ad hoc Networks (VANETs) are a specific class of Mobile Ad hoc Networks (MANETs). Since vehicles tend to move in a high speed, the network topology is rapidly changed. Thus vehicle’s connectivity problem is one of the interesting issues in VANETs. Ad hoc On-demand Multipath Distance Vector (AOMDV) is an extended version of ad hoc on-demand distance vector (AODV). AOMDV is designed to ...

متن کامل

Finding a Solution, all Solutions, or the Most Probable Solution to a Temporal Interval Algebra Network

the years, many implementations have been proposed for solving IA networks. These implementations are concerned with finding a solution efficiently. The primary goal of our implementation is simplicity and ease of use. We present an IA network implementation based on finite domain non-binary CSPs, and constraint logic programming. The implementation has a GUI which permits the drawing of arbitr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004